Towards Merging Binary Integer Programming Techniques with Genetic Algorithms
نویسندگان
چکیده
منابع مشابه
Genetic Algorithms for Binary Quadratic Programming
In this paper, genetic algorithms for the un-constrained binary quadratic programming problem (BQP) are presented. It is shown that for small problems a simple genetic algorithm with uniform crossover is suucient to nd optimum or best-known solutions in short time, while for problems with a high number of variables (n 200) it is essential to incorporate local search to arrive at high-quality so...
متن کاملAlgorithms for Integer Programming
• Unlike linear programming problems, integer programming problems are very difficult to solve. In fact, no efficient general algorithm is known for their solution. • Given our inability to solve integer programming problems efficiently, it is natural to ask whether such problems are inherently “hard”. Complexity theory, offers some insight on this question. It provides us with a class of probl...
متن کاملBinary decision diagrams and integer programming
In this work we show how Binary Decision Diagrams can be used as a powerful tool for 0/1 Integer Programming and related polyhedral problems. We develop an output-sensitive algorithm for building a threshold BDD, which represents the feasible 0/1 solutions of a linear constraint, and give a parallel and -operation for threshold BDDs to build the BDD for a 0/1 IP. In addition we construct a 0/1 ...
متن کاملGradient Methods for Binary Integer Programming
Integer Programming (IP) is a common problem class where decision variables represent indivisibility or yes/no decisions. IP can also be interpreted as discrete optimizations which are extensively used in the areas of routing decisions, fleet assignment, and aircraft/aircrew scheduling. Solving IP models is much harder than solving Linear Programming (LP) models because of their intrinsically c...
متن کاملParsimonious binary-encoding in integer programming
We describe an effective method for doing binary-encoded modeling, in the context of 0/1 linear programming, when the number of feasible configurations is not a power of two. Our motivation comes from modeling all-different restrictions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Operations Research
سال: 2017
ISSN: 1687-9147,1687-9155
DOI: 10.1155/2017/7048042